Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games
نویسنده
چکیده
We consider two-players zero-sum perfect information stochastic games with finitely many states and actions and examine the problem of existence of pure stationary optimal strategies. We show that the existence of such strategies for one-player games (Markov decision processes) implies the existence of such strategies for two-player games. The result is general and holds for any payoff mapping.
منابع مشابه
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences
We examine the problem of the existence of optimal deterministic stationary strategies in two-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions. We show that the existence of such strategies follows from the existence of optimal deterministic stationary strategies for some derived one-player games. Thus we reduce the problem from two-play...
متن کاملStochastic Games and Related Classes
For n-person perfect information stochastic games and for n-person stochastic games with Additive Rewards and Additive Transitions (ARAT) we show the existence of pure limiting average equilibria. Using a similar approach we also derive the existence of limiting average "-equilibria for two-person switching control stochastic games. The orderreld property holds for each of the classes mentioned...
متن کاملMarkov Decision Processes and Stochastic Games with Total Effective Payoff a
We consider finite Markov decision processes (MDPs) with undiscounted total effective payoff. We show that there exist uniformly optimal pure stationary strategies that can be computed by solving a polynomial number of linear programs. We apply this result to two-player zero-sum stochastic games with perfect information and undiscounted total effective payoff, and derive the existence of a sadd...
متن کاملMarkov Decision Processes and Stochastic Games with Total Effective Payoff
We consider finite Markov decision processes (MDPs) with undiscounted total effective payoff. We show that there exist uniformly optimal pure stationary strategies that can be computed by solving a polynomial number of linear programs. We apply this result to two-player zero-sum stochastic games with perfect information and undiscounted total effective payoff, and derive the existence of a sadd...
متن کاملA policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
We give a policy-improvement type algorithm to locate an optimal pure stationary strategy for discounted stochastic games with perfect information. A graph theoretic motivation for our algorithm is presented as well.
متن کامل